package leetcode.D800.T787;

import util.GraphUtil;

/**
 * @File Info: leetcode -- <M787>
 * @Author: 18362
 * @Create: 2022-02-23 20:37:38 星期三
 */
public class M787 {
    public static void main(String[] args) {
        int n = 4;
        int[][] flights = GraphUtil.parseGraph("[[0,1,1],[0,2,5],[1,2,1],[2,3,1]]");
        int src = 0, dst = 3;
        int k = 1;
        System.out.println(new Solution().findCheapestPrice(n, flights, src, dst, k));
    }
}
